The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator
نویسندگان
چکیده
In this paper we show that the existence of general indistinguishability obfuscators conjectured in a few recent works implies, somewhat counterintuitively, strong impossibility results for virtual black box obfuscation. In particular, we show that indistinguishability obfuscation for all circuits implies: • The impossibility of average-case virtual black box obfuscation with auxiliary input for any circuit family with super-polynomial pseudo-entropy. Such circuit families include all pseudo-random function families, and all families of encryption algorithms and randomized digital signatures that generate their required coin flips pseudo-randomly. Impossibility holds even when the auxiliary input depends only on the public circuit family, and not the specific circuit in the family being obfuscated. • The impossibility of average-case virtual black box obfuscation with a universal simulator (with or without any auxiliary input) for any circuit family with super-polynomial pseudo-entropy. These bounds significantly strengthen the impossibility results of Goldwasser and Kalai (STOC 2005). ∗Tel Aviv University, [email protected]. Supported by an IBM Ph.D. Fellowship, and the Check Point Institute for Information Security. †Boston University and Tel Aviv University, [email protected]. Supported by the Check Point Institute for Information Security, an NSF EAGER grant, and an NSF Algorithmic Foundations grant 1218461. ‡Microsoft Research, One Memorial Drive, Cambridge, MA 02142, [email protected]. §MIT and the Weizmann Institute of Science, [email protected]. ¶Microsoft Research, One Memorial Drive, Cambridge, MA 02142, [email protected]. ‖Boston University, [email protected]. Supported by the Simons award for graduate students in theoretical computer science and an NSF Algorithmic foundations grant 1218461. ∗∗Efi Arazi School of Computer Science, IDC Herzliya, Israel, [email protected]. Supported by ISF grant no. 1255/12 and by the ERC under the EU’s Seventh Framework Programme (FP/2007-2013) ERC Grant Agreement n. 307952. ar X iv :1 40 1. 03 48 v3 [ cs .C R ] 1 3 Fe b 20 14
منابع مشابه
The impossibility of obfuscation with a universal simulator
We show that indistinguishability obfuscation implies that all functions with sufficient “pseudoentropy” cannot be obfuscated under a virtual black box definition with a universal simulator. Let F = {fs} be a circuit family with super-polynomial pseudo-entropy, and suppose O is a candidate obfuscator with universal simulator S. We demonstrate the existence of an adversary A that, given the obfu...
متن کاملMore on the Impossibility of Virtual-Black-Box Obfuscation with Auxiliary Input
We show that if there exist indistinguishability obfuscators for a certain class C of circuits then there do not exist independent-auxiliary-input virtual-black-box (VBB) obfuscators for any family of circuits that compute a pseudo-entropic function. A function fk is pseudo-entropic if it is hard, given oracle access to fk but without asking explicitly on a value x, to distinguish fk(x) from a ...
متن کاملIndistinguishability Obfuscation versus Multi-bit Point Obfuscation with Auxiliary Input
In a recent celebrated breakthrough, Garg et al. (FOCS 2013) gave the first candidate for so-called indistinguishability obfuscation (iO) thereby reviving the interest in obfuscation for a general purpose. Since then, iO has been used to advance numerous sub-areas of cryptography. While indistinguishability obfuscation is a general purpose obfuscation scheme, several obfuscators for specific fu...
متن کاملA Note on the Impossibility of Obfuscation with Auxiliary Inputs
In this note we revisit the problem of obfuscation with auxiliary inputs. We show that the existence of indistinguishablity obfuscation (iO) implies that all functions with sufficient “pseudoentropy” cannot be obfuscated with respect to a virtual box definition (VBB) in the presence of (dependent) auxiliary input. Namely, we show that for any candidate obfuscation O and for any function family ...
متن کاملOn the Limits of Point Function Obfuscation
We study the problem of circuit obfuscation, i.e., transforming the circuit in a way that hides everything except its input-output behavior. Barak et al. showed that a universal obfuscator that obfuscates every circuit class cannot exist, leaving open the possibility of special-purpose obfuscators. Known positive results for obfuscation are limited to point functions (boolean functions that ret...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014